The Vertex-Edge Resolvability of Some Wheel-Related Graphs
نویسندگان
چکیده
A vertex w ∈ V H distinguishes (or resolves) two elements (edges or vertices) id="M2"> a , z ∪ E if id="M3"> d ≠ . set id="M4"> W m of vertices in a nontrivial connected graph id="M5"> is said to be mixed resolving for id="M6"> every different and id="M7"> are distinguished by at least one id="M8"> The with minimum cardinality id="M9"> called the metric dimension (vertex-edge resolvability) id="M10"> denoted id="M11"> dim aim this research determine some wheel subdivisions. We specifically analyze compare metric, edge dimensions graphs obtained after graphs’ spoke, cycle, barycentric also prove that sets these independent.
منابع مشابه
Edge-coloring Vertex-weightings of Graphs
Let $G=(V(G),E(G))$ be a simple, finite and undirected graph of order $n$. A $k$-vertex weightings of a graph $G$ is a mapping $w: V(G) to {1, ldots, k}$. A $k$-vertex weighting induces an edge labeling $f_w: E(G) to N$ such that $f_w(uv)=w(u)+w(v)$. Such a labeling is called an {it edge-coloring k-vertex weightings} if $f_{w}(e)not= f_{w}(echr(chr(chr('39')39chr('39'))39chr(chr('39')39chr('39'...
متن کاملEdge pair sum labeling of some cycle related graphs
Let G be a (p,q) graph. An injective map f : E(G) → {±1,±2,...,±q} is said to be an edge pair sum labeling if the induced vertex function f*: V (G) → Z - {0} defined by f*(v) = ΣP∈Ev f (e) is one-one where Ev denotes the set of edges in G that are incident with a vertex v and f*(V (G)) is either of the form {±k1,±k2,...,±kp/2} or {±k1,±k2,...,±k(p-1)/2} U {±k(p+1)/2} according as p is even or o...
متن کاملSome results on vertex-edge Wiener polynomials and indices of graphs
The vertex-edge Wiener polynomials of a simple connected graph are defined based on the distances between vertices and edges of that graph. The first derivative of these polynomials at one are called the vertex-edge Wiener indices. In this paper, we express some basic properties of the first and second vertex-edge Wiener polynomials of simple connected graphs and compare the first and second ve...
متن کاملThe Distance Matrices of Some Graphs Related to Wheel Graphs
A simple graph G = (V, E) consists of V, a nonempty set of vertices, and E, a set of unordered pairs of distinct elements of V called edges. All graphs considered here are simple and connected. LetG be a simple connected graph with vertex set V(G) and edge set E(G).The distance between two vertices u, V ∈ V(G) is denoted by d uV and is defined as the length of the shortest path between u and V ...
متن کاملA note on vertex-edge Wiener indices of graphs
The vertex-edge Wiener index of a simple connected graph G is defined as the sum of distances between vertices and edges of G. Two possible distances D_1(u,e|G) and D_2(u,e|G) between a vertex u and an edge e of G were considered in the literature and according to them, the corresponding vertex-edge Wiener indices W_{ve_1}(G) and W_{ve_2}(G) were introduced. In this paper, we present exact form...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematics
سال: 2021
ISSN: ['2314-4785', '2314-4629']
DOI: https://doi.org/10.1155/2021/1859714